Architectures for Unified Field Inversion with Applications in Elliptic Curve Cryptography
نویسندگان
چکیده
We present two new inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inverse algorithm. An hardware architecture implementing these algorithms is also introduced. In our proposed architecture, the field elements are represented using a multi-word format which allows a scalable and unified architecture to operate in a broad range of precision. This hardware architecture can be used to obtain efficient implementations of elliptic curve cryptography primitives.
منابع مشابه
Low Power Elliptic Curve Cryptography
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euc...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملEfficient Unified Montgomery Inversion with Multibit Shifting
Computation of multiplicative inverses in finite fields GF (p) and GF (2) is the most time consuming operation in elliptic curve cryptography especially when affine coordinates are used. Since the existing algorithms based on extended Euclidean algorithm do not permit a fast software implementation, projective coordinates, which eliminate almost all of the inversion operations from the curve ar...
متن کاملA representation of elements in F2m enabling unified field arithmetic for elliptic curve cryptography
In this letter we propose a change of representation for elements in F 2 m. The proposed representation is useful for architectures that implement unified Montgomery multiplication in finite fields F 2 m and F p used for elliptic curve cryptography since it transforms a standard F 2 m multiplication into a Montgomery multiplication and comes at virtually no cost in terms of conversion operations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002